Evaluating the Complexity of Mathematical Problems: Part 2

In this paper we present an implementation of the computational method in [1] that allows ranking mathematical statements by their complexity. We introduce the complexity classes ICU,iMi¥1, and, accordingly, show that Legendre’s conjecture, Fermat’s last theorem, and Goldbach’s conjecture are in CU,1, Dyson’s conjecture is in CU,2, the Riemann hypothesis is in CU,3, and the four color theorem is in CU,4.